Characterizing Turbulence in Globally Coupled Maps with Stochastic Finite Automata
نویسندگان
چکیده
We describe a method to discriminate between ordered and turbulent behavior in a general class of collective systems Ž . known as Globally Coupled Maps GCM . Our method is able to discover an unknown small ordered region inside the turbulent phase of GCM parameter space. The computational nature of the method is the main novelty of our approach; it is another example of how measures based on computational notions of structure may provide new information in the study of dynamical systems. q 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
Phase plot manifestations in globally coupled maps: effects of scale
Phase plots of coupled maps have shown turbulent, semi-ordered, intermittent and ordered behaviour as a function of control parameters for networks of uniform scale. We investigate the dependence of coupled map dynamics on scale, i.e. number of neurons. We compare results for globally coupled maps (GCMs) and ones with minor lesions, employing a new chaotic function that we propose. The behaviou...
متن کاملCollective motions in globally coupled tent maps with stochastic updating.
We study a generalization of globally coupled maps, where the elements are updated with probability p. When p is below a threshold p(c), the collective motion vanishes and the system is the stationary state in the large size limit. We present the linear stability analysis.
متن کاملAthermal dynamics of strongly coupled stochastic three-state oscillators.
We study the behavior of globally coupled ensembles of cyclic stochastic three-state units with transition rates from i-1 to i proportional to the number of units in state i. Contrary to mean-field theory predictions, numerical simulations show significant stochastic oscillations for sufficiently large coupling strength. The order parameter characterizing units synchrony increases monotonically...
متن کاملMonitorability of Stochastic Dynamical Systems
Monitoring is an important run time correctness checking mechanism. This paper introduces the notions of monitorability and strong monitorability for partially observable stochastic systems, and gives necessary and sufficient conditions characterizing them. It also presents important decidability and complexity results for checking these properties for finite state systems. Furthermore, it pres...
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کامل